Firefly Algorithm for Polynomial Bézier Surface Parameterization
نویسندگان
چکیده
منابع مشابه
Firefly Algorithm for Polynomial Bézier Surface Parameterization
A classical issue in many applied \elds is to obtain an approximating surface to a given set of data points. Yis problem arises in Computer-Aided Design and Manufacturing (CAD/CAM), virtual reality, medical imaging, computer graphics, computer animation, and many others. Very o_en, the preferred approximating surface is polynomial, usually described in parametric form. Yis leads to the problem ...
متن کاملSurface parameterization of nonsimply connected planar Bézier regions
A technique is described for constructing three-dimensional vector graphics representations of planar regions bounded by cubic Bézier curves, such as smooth glyphs. It relies on a novel algorithm for compactly partitioning planar Bézier regions into nondegenerate Coons patches. New optimizations are also described for Bézier inside–outside tests and the computation of global bounds of direction...
متن کاملFirefly Algorithm for Unconstrained Optimization
Meta-heuristic algorithms prove to be competent in outperforming deterministic algorithms for real-world optimization problems. Firefly algorithm is one such recently developed algorithm inspired by the flashing behavior of fireflies. In this work, a detailed formulation and explanation of the Firefly algorithm implementation is given. Later Firefly algorithm is verified using six unimodal engi...
متن کاملThe Bernstein - Bézier Form of a Polynomial −
Note: This document is meant to be viewed in color. If you only have a black and white version you can download a colored version at http://www.math.utah.edu/~pa/bform.pdf Introduction. There are many ways to write a polynomial. One particular representation is the Bernstein-Bézier form (or B-form for short) of a polynomial whose use has become extremely wide spread during the past two decades ...
متن کاملExperiments with Firefly Algorithm
Firefly Algorithm (FA) is one of the recent swarm intelligence methods developed by Xin-She Yang in 2008 [12]. FA is a stochastic, nature-inspired, metaheuristic algorithm that can be applied for solving the hardest optimization problems. The main goal of this paper is to analyze the influence of changing some parameters of the FA when solving bound constrained optimization problems. One of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/237984